Product Code Database
Example Keywords: handheld -tekken $89-169
   » » Wiki: Random Measure
Tag Wiki 'Random Measure'.
Tag
In probability theory, a random measure is a measure-valued . Random measures are for example used in the theory of , where they form many important such as Poisson point processes and .

Definition
Random measures can be defined as transition kernels or as . Both definitions are equivalent. For the definitions, let E be a complete metric space and let \mathcal E be its Borel \sigma -algebra. (The most common example of a separable complete metric space is \R^n .)

As a transition kernel
A random measure \zeta is a () locally finite transition kernel from an abstract probability space (\Omega, \mathcal A, P) to (E, \mathcal E) .

Being a transition kernel means that

  • For any fixed B \in \mathcal \mathcal E , the mapping
\omega \mapsto \zeta(\omega,B)
is measurable from (\Omega, \mathcal A) to (\R, \mathcal B(\R))
  • For every fixed \omega \in \Omega , the mapping
B \mapsto \zeta(\omega, B) \quad (B \in \mathcal E)
is a measure on (E, \mathcal E)

Being locally finite means that the measures

B \mapsto \zeta(\omega, B)
satisfy \zeta(\omega,\tilde B) < \infty for all bounded measurable sets \tilde B \in \mathcal E and for all \omega \in \Omega except some P -

In the context of stochastic processes there is the related concept of a .


As a random element
Define
\tilde \mathcal M:= \{ \mu \mid \mu \text{ is measure on } (E, \mathcal E) \}

and the subset of locally finite measures by

\mathcal M:= \{ \mu \in \tilde \mathcal M \mid \mu(\tilde B) < \infty \text{ for all bounded measurable } \tilde B \in \mathcal E \}

For all bounded measurable \tilde B , define the mappings

I_{\tilde B } \colon \mu \mapsto \mu(\tilde B)

from \tilde \mathcal M to \R . Let \tilde \mathbb M be the \sigma -algebra induced by the mappings I_{\tilde B } on \tilde \mathcal M and \mathbb M the \sigma -algebra induced by the mappings I_{\tilde B } on \mathcal M . Note that \tilde\mathbb M|_{\mathcal M}= \mathbb M .

A random measure is a random element from (\Omega, \mathcal A, P) to (\tilde \mathcal M, \tilde \mathbb M) that almost surely takes values in (\mathcal M, \mathbb M)


Basic related concepts

Intensity measure
For a random measure \zeta, the measure \operatorname E \zeta satisfying
\operatorname E \left = \int f(x) \; \operatorname E \zeta (\mathrm dx)

for every positive measurable function f is called the intensity measure of \zeta . The intensity measure exists for every random measure and is a .


Supporting measure
For a random measure \zeta, the measure \nu satisfying
\int f(x) \; \zeta(\mathrm dx )=0 \text{ a.s. } \text{ iff } \int f(x) \; \nu (\mathrm dx)=0

for all positive measurable functions is called the supporting measure of \zeta. The supporting measure exists for all random measures and can be chosen to be finite.


Laplace transform
For a random measure \zeta, the Laplace transform is defined as
\mathcal L_\zeta(f)= \operatorname E \left

for every positive measurable function f .


Basic properties

Measurability of integrals
For a random measure \zeta , the integrals
\int f(x) \zeta(\mathrm dx)
and \zeta(A) := \int \mathbf 1_A(x) \zeta(\mathrm dx)

for positive \mathcal E -measurable f are measurable, so they are .


Uniqueness
The distribution of a random measure is uniquely determined by the distributions of
\int f(x) \zeta(\mathrm dx)

for all continuous functions with compact support f on E . For a fixed \mathcal I \subset \mathcal E that generates \mathcal E in the sense that \sigma(\mathcal I)=\mathcal E , the distribution of a random measure is also uniquely determined by the integral over all positive \mathcal I -measurable functions f .


Decomposition
A measure generally might be decomposed as:
\mu=\mu_d + \mu_a = \mu_d + \sum_{n=1}^N \kappa_n \delta_{X_n},
Here \mu_d is a diffuse measure without atoms, while \mu_a is a purely atomic measure.


Random counting measure
A random measure of the form:

\mu=\sum_{n=1}^N \delta_{X_n},

where \delta is the and X_n are random variables, is called a or random counting measure. This random measure describes the set of N particles, whose locations are given by the (generally vector valued) random variables X_n. The diffuse component \mu_d is null for a counting measure.

In the formal notation of above a random counting measure is a map from a probability space to the . Here N_X is the space of all boundedly finite integer-valued measures N \in M_X (called ).

The definitions of expectation measure, Laplace functional, moment measures and stationarity for random measures follow those of . Random measures are useful in the description and analysis of Monte Carlo methods, such as Monte Carlo numerical quadrature and .


See also

(2025). 9781848000476, Springer.
(2025). 9783319415963, Springer.
"Crisan, D., Particle Filters: A Theoretical Perspective, in Sequential Monte Carlo in Practice, Doucet, A., de Freitas, N. and Gordon, N. (Eds), Springer, 2001,
(2025). 9780387955414
, Random Measures, 4th edition. Academic Press, New York, London; Akademie-Verlag, Berlin (1986). . An authoritative but rather difficult reference. Jan Grandell, Point processes and random measures, Advances in Applied Probability 9 (1977) 502-526. JSTOR A nice and clear introduction.
(2025). 9783319415963, Springer.

Page 1 of 1
1
Page 1 of 1
1

Account

Social:
Pages:  ..   .. 
Items:  .. 

Navigation

General: Atom Feed Atom Feed  .. 
Help:  ..   .. 
Category:  ..   .. 
Media:  ..   .. 
Posts:  ..   ..   .. 

Statistics

Page:  .. 
Summary:  .. 
1 Tags
10/10 Page Rank
5 Page Refs